Rule Extraction from Ensemble Methods Using Aggregated Decision Trees
نویسنده
چکیده
Ensemble methods have become very well known for being powerful pattern recognition algorithms capable of achieving high accuracy. However, Ensemble methods produces learners that are not comprehensible or transferable thus making them unsuitable for tasks that require a rational justification for making a decision. Rule Extraction methods can resolve this limitation by extracting comprehensible rules from a trained ensembles of classifiers. In this paper, we present an algorithm called REEMTIC that uses a symbolic learning algorithm (Decision Tree) on each underlying classifier of the ensemble and combines them. Experiments and theoretical analysis show REEMTIC generates highly accurate rules that closely approximates the Ensemble Learned Model.
منابع مشابه
Dimension Reduction Using Rule Ensemble Machine Learning Methods: A Numerical Study of Three Ensemble Methods
Ensemble methods for supervised machine learning have become popular due to their ability to accurately predict class labels with groups of simple, lightweight “base learners.” While ensembles offer computationally efficient models that have good predictive capability they tend to be large and offer little insight into the patterns or structure in a dataset. We consider an ensemble technique th...
متن کاملParallel Random Prism: A Computationally Efficient Ensemble Learner for Classification
Generally classifiers tend to overfit if there is noise in the training data or there are missing values. Ensemble learning methods are often used to improve a classifier’s classification accuracy. Most ensemble learning approaches aim to improve the classification accuracy of decision trees. However, alternative classifiers to decision trees exist. The recently developed Random Prism ensemble ...
متن کاملEnsemble-Roller: Planning with Ensemble of Relational Decision Trees
In this paper we describe the ENSEMBLE-ROLLER planner submitted to the Learning Track of the International Planning Competition (IPC). The planner uses ensembles of relational classifiers to generate robust planning policies. As in other applications of machine learning, the idea of the ensembles of classifiers consists of providing accuracy for particular scenarios and diversity to cover a wid...
متن کاملFeature Extraction from Top Association Rules: Effect on Average Predictive Accuracy
In applications of association rule mining, it is fairly difficult to assess computationally the expected interest for the end user of each rule obtained. A number of rule quality measures have been proposed, enjoying varied properties, and leaving no clear winner. Here we propose to glean further intuition by evaluating these rule quality measures through the (possibly negative) improvement in...
متن کاملEnsemble Feature Learning of Genomic Data Using Support Vector Machine
The identification of a subset of genes having the ability to capture the necessary information to distinguish classes of patients is crucial in bioinformatics applications. Ensemble and bagging methods have been shown to work effectively in the process of gene selection and classification. Testament to that is random forest which combines random decision trees with bagging to improve overall f...
متن کامل